Sorting network

Results: 53



#Item
11How to Submit Your Final Camera-Ready Paper for the Genetic Programming 1998 Conference (GP-98)

How to Submit Your Final Camera-Ready Paper for the Genetic Programming 1998 Conference (GP-98)

Add to Reading List

Source URL: www.genetic-programming.org

Language: English - Date: 2006-11-17 21:29:15
12A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman†  Abstract

A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman† Abstract

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2009-11-24 09:49:23
13Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL

Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2011-11-17 23:45:10
1432  CHAPTER 4. DISTRIBUTED SORTING Algorithm 16 Odd/Even Sort 1: Given an array of n nodes (v1 , . . . , vn ), each storing a value (not sorted).

32 CHAPTER 4. DISTRIBUTED SORTING Algorithm 16 Odd/Even Sort 1: Given an array of n nodes (v1 , . . . , vn ), each storing a value (not sorted).

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
15Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning Rina Dechter Department of Information and Computer Science University of California, Irvine

Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning Rina Dechter Department of Information and Computer Science University of California, Irvine

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2000-11-14 17:35:41
16Interval Analysis on Directed Acyclic Graphs for Global Optimization Hermann Schichl and Arnold Neumaier Institut f¨ ur Mathematik, Universit¨at Wien Strudlhofgasse 4, A-1090 Wien, Austria

Interval Analysis on Directed Acyclic Graphs for Global Optimization Hermann Schichl and Arnold Neumaier Institut f¨ ur Mathematik, Universit¨at Wien Strudlhofgasse 4, A-1090 Wien, Austria

Add to Reading List

Source URL: www.mat.univie.ac.at

Language: English - Date: 2003-12-05 12:03:46
17

PDF Document

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:47
18Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne  Ranking is a fundamental activity for organising and, later, understanding data. Advice of the

Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne Ranking is a fundamental activity for organising and, later, understanding data. Advice of the

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
19A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm

A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-04-02 14:14:13
20On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University

On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University

Add to Reading List

Source URL: larc.unt.edu

Language: English - Date: 2011-05-12 16:09:32